Multi-paradigm Logic Programming towards a Higher Order Uniication Based on Proof Nets
نویسنده
چکیده
We study a higher order uniication procedure based on proof nets. In this paper, we present higher order uniication algorithm for intuitionistic implicational multiplicative fragment of proof nets and show termination and soundness for the algorithm.
منابع مشابه
Missing 4 Pages of Text Appeared in Ieee Symposium on Logic Programming 1987 Logic, Equations, and Functions
y We introduce a new paradigm for the integration of functional and logic programming. Unlike most current research, our approach is not based on extending uniication to general-purpose equation solving. Rather, we propose a computation delaying mechanism called residuation. This allows a clear distinction between functional evaluation and logical deduction. The former is based on the-calculus,...
متن کاملFibred Semantics for Feature-Based Grammar Logic
This paper gives a simple method for providing categorial brands of feature-based uniication grammars with a model-theoretic semantics. The key idea is to apply the paradigm of bred semantics (or layered logics, see 15]) in order to combine the two components of a feature-based grammar logic. We demonstrate the method for the augmentation of Lambek categorial grammar with Kasper/Rounds-style fe...
متن کاملBipolar Proof Nets for MALL
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious refinement of Classical Logic. Moreover, we set a correspondence between this paradigm and those more pragmatic ones inspired to transactional or distributed...
متن کاملFunctional Programming 1 First - Order Uni cation by Structural
First-order uniication algorithms (Robinson, 1965) are traditionally implemented via general recursion, with separate proofs for partial correctness and termination. The latter tends to involve counting the number of unsolved variables and showing that this total decreases each time a substitution enlarges the terms. There are many such proofs in the This paper shows how a dependent type can re...
متن کاملA Proof Procedure for the Logic ofHereditary Harrop Formulas Gopalan
A proof procedure is presented for a class of formulas in intuitionistic logic. These formulas are the so-called goal formulas in the theory of hereditary Harrop formulas. Proof search in intuitionistic logic is complicated by the non-existence of a Herbrand-like theorem for this logic: formulas cannot in general be preprocessed into a form such as the clausal form and the construction of a pro...
متن کامل